The Complexity of Inhabitation with Explicit Intersection
نویسندگان
چکیده
It is shown that the inhabitation problem for intersection types without the intersection introduction rule is Expspace-complete and that the further restriction without subtyping is Pspace-complete.
منابع مشابه
Inhabitation of Low-Rank Intersection Types
We prove that the inhabitation problem (“Does there exist a closed term of a given type?”) is undecidable for intersection types of rank 3 and exponential space complete for intersection types of rank 2.
متن کاملIntersection Type Matching and Bounded Combinatory Logic ( Extended
Bounded combinatory logic with intersection types has recently been proposed as a foundation for composition synthesis from software repositories. In such a framework, the algorithmic core in synthesis consists of a type inhabitation algorithm. Since the inhabitation problem is exponential, engineering the theoretical inhabitation algorithm with optimizations is essential. In this paper we deri...
متن کاملThe Inhabitation Problem for Rank Two Intersection Types
We prove that the inhabitation problem for rank two intersection types is decidable, but (contrary to common belief) EXPTIME-hard. The exponential time hardness is shown by reduction from the in-place acceptance problem for alternating Turing machines.
متن کاملIntersection Type Matching with Subtyping
Type matching problems occur in a number of contexts, including library search, component composition, and inhabitation. We consider the intersection type matching problem under the standard notion of subtyping for intersection types: Given intersection types τ and σ, where σ is a constant type, does there exist a type substitution S such that S(τ) is a subtype of σ? We show that the matching p...
متن کاملInhabitation for Non-idempotent Intersection Types
The inhabitation problem for intersection types in λ-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable or the strongly normalizing λ-terms. We prove the decidability of the inhabitation problem for all the systems considered, by providing sound and complete inhabitati...
متن کامل